Pessimal packing shapes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pessimal Packing Shapes

We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions, this question is expected to have a different answer or perhaps no answer at all. As the problem of identifying global minima in most cases appears to be beyon...

متن کامل

Packing Ferrers Shapes

Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n× p(n) rectangle using each of the p(n) distinct Ferrers shapes of size n exactly once. Moreover, the maximum number of pairwise distinct, non-overlapping Ferrers shapes that can be packed in such a rectangle is only Θ(p(n)/ log n).

متن کامل

On Packing 2D Irregular Shapes

Designing and implementing an intelligent system that tackles the problem of placing two-dimensional shapes on a surface, such that no shapes overlap and the uncovered surface area is minimized, is highly important in industrial applications. However, it is also interesting from the scientific perspective, in terms of artificial intelligence, since autonomous systems developed up to now have fo...

متن کامل

Packing non-equal spheres into containers of different shapes

The article reviews a mathematical model of the optimization problem of packing different spheres into a container which can be a cuboid, a sphere, a right circular cylinder, an annular cylinder and a spherical layer. The assumption that sphere radii are variable is exploited. Based on the hypothesis a new way to derive starting point belonging to the feasible region of the problem is offered. ...

متن کامل

Packing with complex shapes in Supply Chain Networked

In this article we are particularly interested in packing objects defined by complex shapes encountered in logistics using Constraint Programming, Metaheuristics and non-linear inequalities.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geometry & Topology

سال: 2015

ISSN: 1364-0380,1465-3060

DOI: 10.2140/gt.2015.19.343